package demo1;

public class MyCircularQueue {
    private    int[] elem;
    private int front;
    private int rear;

    public MyCircularQueue(int k) {
        int[] elem = new int[k+1];

    }


    public boolean enQueue(int value) {
        //入队
        if (isFull()){
            return false;
        }
        elem[rear] = value;
        rear = (rear + 1)% elem.length;
        return true;
    }

    public boolean deQueue() {
        //出队
        if(isEmpty()){
            return false;
        }
        front = (front +1)% elem.length;
        return  true;


    }

    public int Front() {
        //得到队头元素
        if(isEmpty()){
            return -1;
        }
        return elem[front];

    }

    public int Rear() {
        //得到队尾元素
        if(isEmpty()){
            return-1;
        }
        int index = (rear == 0) ? elem.length-1 : rear-1;
        return elem[index];


    }

    public boolean isEmpty() {
        return front == rear;

    }

    public boolean isFull() {
        return (rear + 1) % elem.length == front;

    }
}
